Linear time algorithms for two disjoint paths problems on directed acyclic graphs
نویسندگان
چکیده
منابع مشابه
Finding Disjoint Paths on Directed Acyclic Graphs
Given k + 1 pairs of vertices (s1, s2), (u1, v1), . . . , (uk, vk) of a directed acyclic graph, we show that a modified version of a data structure of Suurballe and Tarjan can output, for each pair (ul, vl) with 1 ≤ l ≤ k, a tuple (s1, t1, s2, t2) with {t1, t2} = {ul, vl} in constant time such that there are two disjoint paths p1, from s1 to t1, and p2, from s2 to t2, if such a tuple exists. Di...
متن کاملParameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
Given a graph and pairs siti of terminals, the edge-disjoint paths problem is to determine whether there exist siti paths that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n where k is the number of paths. It has been a long-standing open question whether it is fixed-parameter tractable in k. We resolve this question in...
متن کاملOn disjoint paths in acyclic planar graphs
We give an algorithm with complexity O(f(R) 2 kn) for the integer multiflow problem on instances (G,H, r, c) with G an acyclic planar digraph and r + c Eulerian. Here, f is a polynomial function, n = |V (G)|, k = |E(H)| and R is the maximum request maxh∈E(H) r(h). When k is fixed, this gives a polynomial algorithm for the arc-disjoint paths problem under the same hypothesis.
متن کاملSteiner Problems on Directed Acyclic Graphs
In this paper we consider two variations of the minimum cost Steiner problem on a directed acyclic graph G V E with a non negative weight on each edge of E The minimum directed Steiner network problem is de ned as follows Given a set of starting vertices S V and a set of terminating vertices T V nd a subgraph with the minimum total edge weight such that for each starting vertex s there exists a...
متن کاملAlgorithms for Junctions in Directed Acyclic Graphs
Given a pair of distinct vertices u, v in a graph G, we say that s is a junction of u, v if there are in G internally vertex disjoint directed paths from s to u and from s to v. We show how to characterize junctions in directed acyclic graphs. We also consider the two problems in the following and derive efficient algorithms to solve them. Given a directed acyclic graph G and a vertex s ∈ G, ho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2012
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.09.025